Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem

نویسندگان

  • Danko Adrovic
  • Jan Verschelde
چکیده

We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orbit are solved only once, allowing for a systematic filtration of redundant data. Computations with cddlib, Gfan, PHCpack, and Sage are illustrated on cyclic n-roots polynomial systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Pretropisms for the Cyclic n-Roots Problem

The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.

متن کامل

Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation

The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of multi-source network coding instances using known bounds on the entropy function region is proposed. This algorithm is based on the Convex Hull Method, which is an algorithm to compute projections of polyhedr...

متن کامل

1 1 N ov 2 00 8 Fulton - MacPherson compactification , cyclohedra , and the polygonal pegs problem

The cyclohedron Wn, known also as the Bott-Taubes polytope, arises both as the polyhedral realization of the poset of all cyclic bracketings of the word x1x2 . . . xn and as an essential part of the Fulton-MacPherson compactification of the configuration space of n distinct, labelled points on the circle S1. The “polygonal pegs problem” asks whether every simple, closed curve in the plane or in...

متن کامل

8 Fulton - MacPherson compactification , cyclohedra , and the polygonal pegs problem

The cyclohedron Wn, known also as the Bott-Taubes polytope, arises both as the polyhedral realization of the poset of all cyclic bracketings of the word x1x2 . . . xn and as an essential part of the Fulton-MacPherson compactification of the configuration space of n distinct, labelled points on the circle S1. The “polygonal pegs problem” asks whether every simple, closed curve in the plane or in...

متن کامل

Special Bertrand Curves in semi-Euclidean space E4^2 and their Characterizations

In [14] Matsuda and Yorozu.explained that there is no special Bertrand curves in Eⁿ and they new kind of Bertrand curves called (1,3)-type Bertrand curves Euclidean space. In this paper , by using the similar methods given by Matsuda and Yorozu [14], we obtain that bitorsion of the quaternionic curve is not equal to zero in semi-Euclidean space E4^2. Obtain (N,B2) type quaternionic Bertrand cur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013